Turing computability
英
美
图灵机可计算性
双语例句
- The technical details of things like Turing completeness and theories of computability are beyond most of them.
如图灵可计算的完整性和理论的东西的技术细节超出了大多数。 - In this paper, the partial recursive function is constructed by Hopfield neural networks. The partial recursive function is equivalent with Turing machine, the computability of Hopfield neural networks is therefore equivalent with Turing machine.
本文给出了用Hopfield网计算部分递归函数的构造性证明.由于部分递归函数与图灵机等价，故Hopfield网与图灵机等价。 - Turing machine takes the intuition conception of feasible computability into strict formality and the "Church-Turing Thesis" that "any feasible computability function is universal Turing machine computability" is come into being.
图灵机把关于能行可计算的直观看法变成了严格的形式定义，于是形成了任何能行可计算的函数都是通用图灵机可计算的这一丘奇-图灵论题。